Intelligent Computer Mathematics by Manfred Kerber Jacques Carette Cezary Kaliszyk Florian Rabe & Volker Sorge

Author:Manfred Kerber, Jacques Carette, Cezary Kaliszyk, Florian Rabe & Volker Sorge
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham

if there is a view and a view , , and a view where contains constant const then we can use the constant name , to refer to const (as translated over the assignments from the views) from T.

if is a nested module in T, ..., and is a nested module in we can use the theory name to refer to theory .

The Mmt system provides an API to the Mmt data structures described above and the Mmt implementation [Rab08, RK13] provides a Scala-based [OSV07] open source implementation of the Mmt API.

Generating Induced Knowledge. In the context of theory graphs we model the process of generating the knowledge space as an operation on theory graphs. Specifically, one that takes a theory graph G and return an enriched graph where a new part of the mathematical knowledge space is explicitly represented. We call the induced theory graph.

Accessing Induced Knowledge. A key aspect of Mmt is that it’s URI language is expressive enough to produce URIs for the induced statements that are not only unique but also informative. Specifically, we can compute the induced knowledge entities from the induced theory graph by their URI and the original graph alone, and furthermore, we can generate explanations for the existence of each induced statement in terms of the original theory graph. We call this property of Mmt URIs information completeness.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.